Formulation forSingle - Machine Scheduling Problems : Branch - and

نویسندگان

  • J M Van Den Akker
  • C A J Hurkens
  • M W P Savelsbergh
چکیده

In Van den Akker, Van Hoesel, and Savelsbergh 1994], we have studied a time-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand sides 1 and 2 of the convex hull of the monotone extension of the set of feasible schedules. In this paper, we discuss the development of a branch-and-cut algorithm based on these facet inducing inequalities. We describe separation algorithms for each class of these inequalities, and elaborate on various other important components of the branch-and-cut algorithm, such as branching strategies, cut generation schemes, and primal heuristics. We present our computational experiences with the algorithm for the problem of minimizing the total weighted completion time on a single machine subject to release dates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formulation forSingle - Machine Scheduling Problems : Column GenerationJ

Time-indexed formulations for single-machine scheduling problems have received a lot of attention, because the linear program relaxations provide strong bounds. Unfortunately, time-indexed formulations have one major disadvantage: their size. Even for relatively small instances the number of constraints and the number of variables can be large. In this paper, we discuss how Dantzig-Wolfe decomp...

متن کامل

Two-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect

This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...

متن کامل

Net Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

متن کامل

Net Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

متن کامل

Solving Parallel Machine Scheduling Problems by Column Generation

We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The decomposition approach rst formulates these problems as an integer program, and then reformulates the integer program, using Dantzig-Wolfe decomposition, as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995